Handling inconsistency in partially preordered ontologies: the Elect method

Abstract We focus on the problem of handling inconsistency in lightweight ontologies. assume that terminological knowledge base (TBox) is specified DL-Lite and set assertional facts (ABox) partially preordered may be inconsistent with respect to TBox. One main contributions this paper provision an efficient safe method, called Elect, restore consistency ABox In case where flat (i.e. no priorities are associated ABox) or totally preordered, we show our method collapses well-known intersection repair semantics non-defeated semantics, respectively. The semantic justification Elect obtained by first viewing a as family ABoxes then applying inference each ABoxes. introduce notion elected assertions which allows us provide equivalent characterization without explicitly generating all computing done polynomial time size ABox. second part discusses how go beyond method. particular, discuss what extent can generalized description logics more expressive than DL-Lite.